Breaking the Theta(n log ^2 n) Barrier for Sorting with Faults (Extended Abstract)
نویسندگان
چکیده
We study the problem of constructing a sorting circuit, network, or PRAM algorithm that is tolerant to faults. For the most part, we focus on fault patterns that are random, e.g., where the result of each comparison is independently faulty with probability upperbounded by some constant. All previous fault-tolerant sorting circuits, networks, and parallel algorithms require R(log2 n) depth (time) and/or n(n log2 n) comparisons to sort n items. In this paper, we construct
منابع مشابه
Breaking the (n Log 2 N) Barrier for Sorting with Faults
In this paper, we study the problem of constructing a sorting circuit, network, or PRAM algorithm that is tolerant to faults. For the most part, we focus on fault patterns that are random, i.e., where the result of each comparison is independently faulty with probability upper-bounded by some constant. All previous fault-tolerant sorting circuits, networks, and parallel algorithms require (log ...
متن کاملAdmissible and Minimax Estimator of the Parameter $theta$ in a Binomial $Bin( n ,theta)$ distribution under Squared Log Error Loss Function in a Lower Bounded Parameter Space
Extended Abstract. The study of truncated parameter space in general is of interest for the following reasons: 1.They often occur in practice. In many cases certain parameter values can be excluded from the parameter space. Nearly all problems in practice have a truncated parameter space and it is most impossible to argue in practice that a parameter is not bounded. In truncated parameter...
متن کاملOptimal Resilient Sorting and Searching in the Presence of Memory Faults
We investigate the problem of reliable computation in the presence of faults that may arbitrarily corrupt memory locations. In this framework, we consider the problems of sorting and searching in optimal time while tolerating the largest possible number of memory faults. In particular, we design an O(n log n) time sorting algorithm that can optimally tolerate up to O( √ n log n ) memory faults....
متن کاملFault-Tolerant Sorting Networks
This thesis studies sorting circuits, networks, and PRAM algorithms that are tolerant to faults. We consider both worst-case and random fault models, although we mainly focus on the more challenging problem of random faults. In the random fault model, the circuit, network, or algorithm is required to sort all n-input permutations with probability at least 1 -1 even if the result of each compari...
متن کاملTolerating Faults in Counting Networks
Counting networks were proposed by Aspnes, Herlihy and Shavit 4] as a technique for solving multiprocessor coordination problems. We describe a method for tolerating an arbitrary number of faults in counting networks. In our fault model, the following errors can occur dynamically in the counting network data structure: 1) a balancer's state is spuriously altered, 2) a balancer's state can no lo...
متن کامل